Short and Robust Communication Paths in Dynamic Wireless Networks
Identifieur interne : 000815 ( France/Analysis ); précédent : 000814; suivant : 000816Short and Robust Communication Paths in Dynamic Wireless Networks
Auteurs : Yoann Pigné [Luxembourg (pays)] ; Frédéric Guinand [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2010.
Abstract
Abstract: We consider the problem of finding and maintaining communication paths in wireless mobile ad hoc networks (MANET). We consider this problem as a bi-objective problem when trying to minimize both the length of the constructed paths and the number link reconnections. We propose two centralized algorithms that help analyse the problem from a dynamic graph point of view. These algorithms give lower bounds for our proposed decentralized ant-based algorithm that constructs and maintains such paths in a MANET.
Url:
DOI: 10.1007/978-3-642-15461-4_52
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000B86
- to stream Istex, to step Curation: 000B86
- to stream Istex, to step Checkpoint: 000169
- to stream Main, to step Merge: 000986
- to stream Main, to step Curation: 000985
- to stream Main, to step Exploration: 000985
- to stream France, to step Extraction: 000815
Links to Exploration step
ISTEX:F7B7A984C4D8C90207BD6C2AD41FD7C7621646BBLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Short and Robust Communication Paths in Dynamic Wireless Networks</title><author><name sortKey="Pigne, Yoann" sort="Pigne, Yoann" uniqKey="Pigne Y" first="Yoann" last="Pigné">Yoann Pigné</name></author><author><name sortKey="Guinand, Frederic" sort="Guinand, Frederic" uniqKey="Guinand F" first="Frédéric" last="Guinand">Frédéric Guinand</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:F7B7A984C4D8C90207BD6C2AD41FD7C7621646BB</idno><date when="2010" year="2010">2010</date><idno type="doi">10.1007/978-3-642-15461-4_52</idno><idno type="url">https://api.istex.fr/document/F7B7A984C4D8C90207BD6C2AD41FD7C7621646BB/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000B86</idno><idno type="wicri:Area/Istex/Curation">000B86</idno><idno type="wicri:Area/Istex/Checkpoint">000169</idno><idno type="wicri:doubleKey">0302-9743:2010:Pigne Y:short:and:robust</idno><idno type="wicri:Area/Main/Merge">000986</idno><idno type="wicri:Area/Main/Curation">000985</idno><idno type="wicri:Area/Main/Exploration">000985</idno><idno type="wicri:Area/France/Extraction">000815</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Short and Robust Communication Paths in Dynamic Wireless Networks</title><author><name sortKey="Pigne, Yoann" sort="Pigne, Yoann" uniqKey="Pigne Y" first="Yoann" last="Pigné">Yoann Pigné</name><affiliation wicri:level="1"><country xml:lang="fr">Luxembourg (pays)</country><wicri:regionArea>SnT, University of Luxembourg</wicri:regionArea><wicri:noRegion>University of Luxembourg</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Luxembourg (pays)</country></affiliation></author><author><name sortKey="Guinand, Frederic" sort="Guinand, Frederic" uniqKey="Guinand F" first="Frédéric" last="Guinand">Frédéric Guinand</name><affiliation wicri:level="1"><country xml:lang="fr">France</country><wicri:regionArea>LITIS, University of Le Havre</wicri:regionArea><wicri:noRegion>University of Le Havre</wicri:noRegion><wicri:noRegion>University of Le Havre</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2010</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">F7B7A984C4D8C90207BD6C2AD41FD7C7621646BB</idno><idno type="DOI">10.1007/978-3-642-15461-4_52</idno><idno type="ChapterID">52</idno><idno type="ChapterID">Chap52</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We consider the problem of finding and maintaining communication paths in wireless mobile ad hoc networks (MANET). We consider this problem as a bi-objective problem when trying to minimize both the length of the constructed paths and the number link reconnections. We propose two centralized algorithms that help analyse the problem from a dynamic graph point of view. These algorithms give lower bounds for our proposed decentralized ant-based algorithm that constructs and maintains such paths in a MANET.</div></front></TEI><affiliations><list><country><li>France</li><li>Luxembourg (pays)</li></country></list><tree><country name="Luxembourg (pays)"><noRegion><name sortKey="Pigne, Yoann" sort="Pigne, Yoann" uniqKey="Pigne Y" first="Yoann" last="Pigné">Yoann Pigné</name></noRegion><name sortKey="Pigne, Yoann" sort="Pigne, Yoann" uniqKey="Pigne Y" first="Yoann" last="Pigné">Yoann Pigné</name></country><country name="France"><noRegion><name sortKey="Guinand, Frederic" sort="Guinand, Frederic" uniqKey="Guinand F" first="Frédéric" last="Guinand">Frédéric Guinand</name></noRegion><name sortKey="Guinand, Frederic" sort="Guinand, Frederic" uniqKey="Guinand F" first="Frédéric" last="Guinand">Frédéric Guinand</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/France/explor/LeHavreV1/Data/France/Analysis
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000815 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/France/Analysis/biblio.hfd -nk 000815 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/France
|area= LeHavreV1
|flux= France
|étape= Analysis
|type= RBID
|clé= ISTEX:F7B7A984C4D8C90207BD6C2AD41FD7C7621646BB
|texte= Short and Robust Communication Paths in Dynamic Wireless Networks
}}
| This area was generated with Dilib version V0.6.25. |  |